New Valid Inequalities for a Multi-echelon Multi-item Lot-Sizing Problem with Returns and Lost Sales

نویسندگان

چکیده

This work studies a multi-echelon multi-item lot-sizing problem with remanufacturing and lost sales. The is formulated as mixed-integer linear program. A new family of valid inequalities taking advantage the structure introduced used in customized branch-and-cut algorithm. provided numerical results show that proposed algorithm outperforms both generic embedded standard-alone mathematical solver previously published

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristics for the multi-item capacitated lot-sizing problem with lost sales

This paper deals with the multi-item capacitated lot-sizing problem with setup times and lost sales. Because lost sales, demands can be partially or totally lost. To find a good lower bound, we use a Lagrangian relaxation of the capacity constraints, when single-item uncapacitated lot-sizing problems with lost sales have to be solved. Each subproblem is solved using an adaptation of the O(T ) d...

متن کامل

The single-item lot-sizing problem with immediate lost sales

e introduce a profit maximization version of the well-known Wagner-Whitin model for the deterministic uncapacitated single-item lot-sizing problem with lost sales. Demand cannot be backlogged, but it does not have to be satisfied, either. Costs and selling prices are assumed to be time-variant, differentiating our model from previous models with lost sales. Production quantities and levels of l...

متن کامل

Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing

This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...

متن کامل

three metaheuristic algorithms for solving the multi-item capacitated lot-sizing problem with product returns and remanufacturing

this paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. the returned products from customers can either be disposed or be remanufactured to be sold as new ones again. due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (sa) al...

متن کامل

Single item lot-sizing problem for a warm/cold process with immediate lost sales

We consider the dynamic lot-sizing problem with finite capacity and possible lost sales for a process that could be kept warm at a unit variable cost for the next period t + 1 only if more than a threshold value Qt has been produced and would be cold, otherwise. Production with a cold process incurs a fixed positive setup cost, Kt and setup time, St, which may be positive. Setup costs and times...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-87672-2_13